Conjunctive Visibly-Pushdown Path Queries
نویسندگان
چکیده
We investigate an extension of conjunctive regular path queries in which path properties and path relations are defined by visibly pushdown automata. We study the problem of query evaluation for extended conjunctive visibly pushdown path queries and their subclasses, and give a complete picture of their combined and data complexity. In particular, we introduce a weaker notion called extended conjunctive reachability queries for which query evaluation has a polynomial data complexity. We also show that query containment is decidable in 2-EXPTIME for (non-extended) conjunctive visibly pushdown path queries.
منابع مشابه
Querying Streaming XML Using Visibly Pushdown Automata
We present a novel solution to streaming XPath query evaluation, capable of supporting forward and reverse axes queries. We show a conversion of an XPath query to a Visibly Pushdown Automaton that preserves the semantics of the query. It was shown in [1] that such a construction results in an automation suitable for efficient streaming query evaluation. We also show that the constructed automat...
متن کاملAn optimization of disjunctive queries: union-pushdown
Most previous works on query optimization techniques deal with conjunctive queries only because the queries with disjunctive predicates are complex to optimize. Hence, for disjunctive queries, query optimizers based on these techniques generate plans using rather simple methods such as CNFand DNF-based optimization. However, the plans generated by these methods perform extremely poorly for cert...
متن کاملInput-driven languages are linear conjunctive
Linear conjunctive grammars define the same family of languages as one-way real-time cellular automata (A. Okhotin, “On the equivalence of linear conjunctive grammars to trellis automata”, RAIRO ITA, 2004), and this family is known to be incomparable with the context-free languages (V. Terrier, “On real-time one-way cellular array”, Theoret. Comput. Sci., 1995). This paper demonstrates the cont...
متن کاملA Unifying Approach for Multistack Pushdown Automata
We give a general approach to show the closure under complement and decide the emptiness for many classes of multistack visibly pushdown automata (Mvpa). A central notion in our approach is the visibly path-tree, i.e., a stack tree with the encoding of a path that denotes a linear ordering of the nodes. We show that the set of all such trees with a bounded size labeling is regular, and path-tre...
متن کاملVisibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is given by a visibly pushdown language. We establish that, unlike pushdown games with pushdown winning conditio...
متن کامل